This represents exponential time complexity, which means that the execution time doubles with every increase in input size. Examples include brute force algorithms that test every possible combination of inputs.
This represents exponential time complexity, which means that the execution time doubles with every increase in input size. Examples include brute force algorithms that test every possible combination of inputs.